search tree
英 [sɜːtʃ triː]
美 [sɜːrtʃ triː]
网络 搜索树; 检索树; 棵查找树; 查找树; 搜索树技术
双语例句
- The depth-first search algorithm progresses from one node in the search tree to the next by guessing a value for an empty cell or executing the rule engine.
通过猜测某个空格的值或执行规则引擎，深度优先搜索算法从搜索树中的一个节点前进到下一个节点。 - It maintains the free space in heap as nodes in a Cartesian binary search tree format.
它按照Cartesian二分法检索树格式以节点的形式维护堆中的空闲空间。 - Each node in the search tree is represented by an INode interface, which has methods to determine whether the node is a goal state or dead end.
搜索树上的每个节点都由一个INode接口表示，该接口使用一些方法判断节点是目标状态还是死胡同。 - Recognizing this fact, a generic algorithm has been devised that can use any rule engine and work with any search tree.
认识到这一点后，人们提出了一种通用的算法，可以使用任何规则引擎并结合使用任意搜索树。 - Red-black tree is a self-balancing binary search tree.
红黑树是一个自平衡的二叉查找树。 - A node in our search tree is nothing but a Sudoku configuration.
搜索树中的节点其实就是一种数独配置。 - Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem.
用一个二叉搜索树或者将串切分成长度的平方根那么长的小段都可以解决这个问题。 - Mobile terminals; MMI software; Ternary search tree; Message-driven mechanism;
移动终端；MMI软件；三元搜索树；消息驱动机制； - The highly balanced binary search tree is established in order to improve efficiency of the binary search tree and to shorten the average search tree.
建立高度平衡的二叉搜索树是为了提高二叉搜索树的效率，减少树的平均搜索长度。 - Bounded search tree and dynamic programming are frequently-used techniques in parameterized algorithm.
在典型的参数算法中，有界搜索树和动态规划是常用技术。 - A scapegoat tree is a self-balancing binary search tree, that provides worst-case O ( log n) lookup time, and O ( log n) amortized insertion and deletion time.
替罪羊树是一种自平衡的二分查找树，它提供了最坏情况下的O（logn）查找时间，以及O（logn）的分期插入和删除时间。 - It was as if, when we went through this search tree, we never remembered what we got at the bottom, and we just re-computed things over and over.
如果当我们遍历完这棵树，我们不可能，记得我们在最下面得到什么结果，我们只是不断地重复计算，所以这让。 - Unlike other self-balancing binary search trees that provide worst case O ( log n) lookup time, scapegoat trees have no additional per-node overhead compared to a regular binary search tree.
和其它的提供了最坏情况O（logn）查找时间的自平衡二分查找树不同，替罪羊树与普通的二分查找树相比，并没有对每个节点增加额外的开销。 - Realization and Application of Fast Dynamic Priority Search Tree
快速动态优先搜索树的实现及其应用 - The strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components.
强连通分量形成了搜索树，他们的根就是强连通分量的根。 - The results show that it is more effective than the binary search tree.
结果表明，它比二元查找树更为有效。 - Parallel Search Tree Based on Attribute Set Division in Publish/ Subscribe Systems
发布/订阅系统中基于属性集划分的并行搜索树 - Taking gobang as an example, this paper proposes the base scheme for solve game problem by adopting the notion of genetic algorithms instead of search tree, and makes some exploratory work on the design of fitness function, it also provides with requirements for designing fitness function.
以五子棋为例，提出了用遗传算法代替搜索树法解决博弈问题的基本方案，并对适应度函数的设计作了一些有益地探索，给出了设计适应度函数应满足的必要条件。 - The gridding arithmetic of search tree of robotic path is derived.
同时，还推导了机器人路径搜索树网格算法。 - Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation.
本文主要研究随机递归树和随机二叉搜索树上与分支和子树相关的极限定理。 - The algorithm provides the possibility of reducing the size of the search tree and running time.
该算法从理论上提供了减小搜索树的规模及运行时间的可能性。 - The previous research on B& B algorithm focused on simplifying the search tree in order to reduce the search complexity, and several improvements have already existed.
对B＆B算法的研究集中在化简搜索树从而降低搜索复杂度上，提出了几种改进的B＆B算法。 - B& B algorithm constructs a search tree, and then searches for the optimal feature subset in the tree.
用B＆B算法构造一棵搜索树，在树中搜索最优的特征子集。 - Using the idea of KMP arithmetic, digital search tree has been turned into improved doubly-chained tree through added assistant jump-node.
通过借鉴KMP算法的思想，在键树的基础上增加了将辅助跳转结点变成改进的双链树。 - With the aid of a new image data structure, the digital search tree, as a mid storage structure, the image data can be efficiently compressed, and the insertion operations can be sped up. Therefore, the efficiency of the new algorithm is higher.
借助于一种新的图像数据结构&数字搜索树作为中间存储结构，有效地压缩了数据并加快了插入速度，因而本算法有较高的效率。 - This dissertation provides a search algorithm based on weighted search tree.
对此提出了基于有权搜索树的搜索算法。 - This paper applies multidimensional binary search tree ( KD tree) to DoS detection.
本文提出了将多维二进制搜索树（KD树）应用于DoS攻击检测的方法。 - This article uses the limited depth of the search tree technology can be fixed parameters algorithm is designed.
本文采用深度受限搜索树技术设计了固定参数可解算法。 - During the design and implementation of the phonebook, the ternary search tree ( TST) is used to improve the operating efficiency of the phonebook.
在电话本软件的设计与实现中，引入了三元搜索树（TST）技术，提高了电话本的运行效率。 - Among them, the distribution network troubleshooting mode adopts the new algorithm of the distribution network troubleshooting based on search tree, which possesses faster speed.
其中配网故障处理模式采用基于搜索树的配网故障处理新算法，此方法具有较快的速度。